منابع مشابه
Counting Hypergraph Matchings up to Uniqueness Threshold
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter λ, each matching M is assigned a weight λ|M |. The counting problem is formulated as computing a partition function that gives the sum of the weights of all matchings in a hypergraph. This problem unifies two extensively studied statistical...
متن کاملComputing the Partition Function for Perfect Matchings in a Hypergraph
Given non-negative weights wS on the k-subsets S of a km-element set V , we consider the sum of the products wS1 · · ·wSm over all partitions V = S1 ∪ . . . ∪ Sm into pairwise disjoint k-subsets Si. When the weights wS are positive and within a constant factor, fixed in advance, of each other, we present a simple polynomial time algorithm to approximate the sum within a polynomial in m factor. ...
متن کاملOn the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems. It is shown that the Hamming distance between feasible solutions of hypergraph matching problems can be computed as an optimal value of linear assignment problem. For random hypergraph matching problems, an upper boun...
متن کاملDynamic matchings and quasidynamic fractional matchings. II
Consider a directed graph G in which every edge has an associated real-valued distance and a real-valued weight. The weight of an undirected circuit of G is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circuit minus the sum of the distances of the backward edges. A trivial circuit is a two-edge circuit...
متن کاملDynamic matchings and quasidynamic fractional matchings. I
This paper presents and solves in polynomial time the dynamic matching problem, an integer programming problem which involves matchings in a time-expanded infinite network. The initial model is a finite directed graph G = (V, E) in which each edge has an associated real-valued weight and an integral distance. We wish to "match" vertices over an infinite horizon, and we permit vertex i in period...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2020
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548320000280